Low-overhead code concatenation approaches for universal quantum computation

نویسندگان

چکیده

Fault-tolerant quantum circuit design can be done by using a set of transversal gates. However, as there is no error correction code with universal gates, several approaches have been proposed which, in combination make fault-tolerant computation possible. Magic state distillation, gauge fixing, switching, concatenation and pieceable fault tolerance are well-known examples such approaches. the overhead these one main bottlenecks for large-scale computation. In this paper, two computation, mainly based on concatenation, proposed. The first approach combines or magic distillation second extends nonuniformity concatenated codes allowing to apply CNOT gates between different codes. outperform terms both number qubits distance also significantly less resource than distillation. This achieved at cost reducing effective implementing non-transversal

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Majorana Fermion Surface Code for Universal Quantum Computation Citation

The MIT Faculty has made this article openly available. Please share how this access benefits you. Your story matters. We introduce an exactly solvable model of interacting Majorana fermions realizing Z 2 topological order with a Z 2 fermion parity grading and lattice symmetries permuting the three fundamental anyon types. We propose a concrete physical realization by utilizing quantum phase sl...

متن کامل

Majorana Fermion Surface Code for Universal Quantum Computation

We introduce an exactly solvable model of interacting Majorana fermions realizing Z2 topological order with a Z2 fermion parity grading and lattice symmetries permuting the three fundamental anyon types. We propose a concrete physical realization by utilizing quantum phase slips in an array of Josephson-coupled mesoscopic topological superconductors, which can be implemented in a wide range of ...

متن کامل

Toward fault-tolerant quantum computation without concatenation

It has been known that quantum error correction via concatenated codes can be done with exponentially small failure rate if the error rate for physical qubits is below a certain accuracy threshold. Other, unconcatenated codes with their own attractive features—improved accuracy threshold, local operations—have also been studied. By iteratively distilling a certain two-qubit entangled state it i...

متن کامل

Quantum cellular automaton for universal quantum computation

A number of physical systems that are considered for the realization of a universal quantum computer, such as optical lattices 1 or arrays of microlenses 2 , possess a translation symmetry in the arrangement of qubits and their mutual interaction. Quantum cellular automata QCA represent a suitable framework to explore the computational power of such physical systems, because they respect this s...

متن کامل

Fault-tolerant quantum computation with constant overhead

What is the minimum number of extra qubits needed to perform a large fault-tolerant quantum circuit? Working in a common model of fault-tolerance, I show that in the asymptotic limit of large circuits, the ratio of physical qubits to logical qubits can be a constant. The construction makes use of quantum low-density parity check codes, and the asymptotic overhead of the protocol is equal to tha...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Quantum Information Processing

سال: 2023

ISSN: ['1573-1332', '1570-0755']

DOI: https://doi.org/10.1007/s11128-023-03829-1